LUCENE-9099: Correctly handle repeats in ORDERED and UNORDERED intervals #1097
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
If you have repeating intervals in an ordered or unordered interval source, you currently get somewhat confusing behaviour:
ORDERED(a, a, b)
will return an extra interval over justa b
if it first matchesa a b
, meaning that you can get incorrect results if used in aCONTAINING
filter -CONTAINING(ORDERED(x, y), ORDERED(a, a, b))
will match on the documenta x a b y
UNORDERED(a, a)
will match on documents that just containg a singlea
.This commit adds a
RepeatingIntervalsSource
that correctly handles repeats within ordered and unordered sources. It also changes the way that gaps are calculated within ordered and unordered sources, by using a newwidth()
method onIntervalIterator
. The default implementation just returnsend() - start() + 1
, butRepeatingIntervalsSource
instead returns the sum of the widths of its child iterators. This preservesmaxgaps
filtering on ordered and unordered sources that contain repeats.In order to correctly handle matches in this scenario,
IntervalsSource#matches
now always returns an explicitIntervalsMatchesIterator
rather than a plainMatchesIterator
, which addsgaps()
andwidth()
methods so that submatches can be combined in the same way that subiterators are. Extra checks have been added tocheckIntervals()
to ensure that the same intervals are returned by both iterator and matches, and a fix toDisjunctionIntervalIterator#matches()
is also included -DisjunctionIntervalIterator
minimizes its intervals, whileMatchesUtils.disjunction
does not, so there was a discrepancy between the two methods.